Partitioning Wide Area Graphs Using a Space Filling Curve
نویسندگان
چکیده
Graph structure is a very powerful tool to model system and represent their actual shape. For instance, modelling an infrastructure or social network naturally leads graph. Yet, graphs can be different from one another as they do not share the same properties (size, connectivity, communities, etc.) building able manage should take into account this diversity. A big challenge concerning graph management design providing scalable persistent storage allowing efficient browsing. Mainly study graphs, most recent developments in partitioning research often consider scale-free graphs. As we are interested connected objects context, focus on geometric Consequently our strategy differs, geometry main tool. In fact, rely Inverse Space-filling Partitioning, technique which relies space filling curve partition was previously applied essentially generated Meshes. Furthermore, extend Space-Filling Partitioning toward new target define Wide Area Graphs. We provide extended comparison with two state-of-the-art streaming strategies, namely LDG FENNEL. also propose customized metrics better understand identify use cases for ISP solution best suited. Experimentations show that favourable contexts, edge-cuts drastically reduced, going more 34% using FENNEL less than 1% ISP.
منابع مشابه
A space-filling curve
In mathematics classes where the natural numbers are studied, several surprising results can be shown about the relative “sizes” of infinite sets, such as the fact the there is a oneto-one mapping between the natural numbers N and the even numbers, showing that they are both countably infinite, with the “same size”. Similar logic also shows that there is a mapping from the natural numbers N ont...
متن کاملA space-filling curve
In mathematics classes where the natural numbers are studied, several surprising results can be shown about the relative “sizes” of infinite sets, such as the fact the there is a oneto-one mapping between the natural numbers N and the even numbers, showing that they are both countably infinite, with the “same size”. Similar logic also shows that there is a mapping from the natural numbers N ont...
متن کاملParallel space-filling curve generation
A key aspect of the parallel partitioners of AMR codes based on meshes consisting of regularly refined patches lies in the choice of a load balancing algorithm. One of the current load balancing methods of choice is to use a space-filling curve. The need to apply load balancing in parallel on possibly hundreds of thousands of processors has led to the development of an algorithm which generates...
متن کاملOnion Curve: A Space Filling Curve with Near-Optimal Clustering
Space filling curves (SFCs) are widely used in the design of indexes for spatial and temporal data. Clustering is a key metric for an SFC, that measures how well the curve preserves locality in moving from higher dimensions to a single dimension. We present the onion curve, an SFC whose clustering performance is provably close to optimal for cube and nearcube shaped query sets, irrespective of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Data Mining & Knowledge Management Process
سال: 2021
ISSN: ['2230-9608', '2231-007X']
DOI: https://doi.org/10.5121/ijdkp.2021.11102